package ink.lovejinhu.special.dp;

/**
 * @author jinhu
 * created 2021-07-26 16:59
 */
public class Solution_0045 {
    /**
     * 跳跃游戏
     *
     * @param nums
     * @return
     */
    public int jump(int[] nums) {
        int target = 0;
        int max = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            for (int j = 0; j <= nums[i]; j++) {


            }

        }
        return 0;
    }
}
